Presentations of groups with even length relations
نویسندگان
چکیده
We study the properties of groups that have presentations in which generating set is a fixed involutions and all additional relations are even length. consider parabolic subgroups such group show every element has factorization with respect to given subgroup. Furthermore, we give counterexample, using cluster presentation, demonstrates this not necessarily unique.
منابع مشابه
Presentations of Topological Full Groups by Generators and Relations
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the world problem in a topological full group is solvable if and only if the language of the underlying subshift is recursive.
متن کاملFinite groups have even more centralizers
For a finite group $G$, let $Cent(G)$ denote the set of centralizers of single elements of $G$. In this note we prove that if $|G|leq frac{3}{2}|Cent(G)|$ and $G$ is 2-nilpotent, then $Gcong S_3, D_{10}$ or $S_3times S_3$. This result gives a partial and positive answer to a conjecture raised by A. R. Ashrafi [On finite groups with a given number of centralizers, Algebra Collo...
متن کاملBinary doubly - even self - dual codes of length 72 with large automorphism groups ∗
We study binary linear codes constructed from fifty-four Hadamard 2-(71, 35, 17) designs. The constructed codes are self-dual, doubly-even and self-complementary. Since most of these codes have large automorphism groups, they are suitable for permutation decoding. Therefore we study PD-sets of the obtained codes. We also discuss the errorcorrecting capability of the obtained codes by majority l...
متن کاملLexical Presentations of Groups
Using elementary ideas from formal language theory we introduce a kind of group presentation which makes solution of the word problem easy in the case of a nite group, and which in that case also makes possible an eecient algorithm to compute a traversal, i.e., a list of strings in generators in which each group element occurs exactly once.
متن کاملFinitely generated groups with automatic presentations
A structure is said to be computable if its domain can be represented by a set which is accepted by a Turing machine and if its relations can then be checked using Turing machines. Restricting the Turing machines in this definition to finite automata gives us a class of structures with a particularly simple computational structure; these structures are said to have automatic presentations. Give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 2021
ISSN: ['1532-4125', '0092-7872']
DOI: https://doi.org/10.1080/00927872.2021.1955903